An optimally data efficient isomorphism inference algorithm
نویسندگان
چکیده
منابع مشابه
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of filtering-and-verification to reduce the p...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملOptimally Predictive Causal Inference
Natural systems compute intrinsically and produce information. The organization of a stochastic dynamical system is reflected in the time series of observations made of the system and can be quantified by the excess entropy or predictive information—the mutual information between past and future. This information can be used to build models of varying complexity that capture the causal structur...
متن کاملan efficient cluster head selection algorithm for wireless sensor networks using fuzzy inference systems
an efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. the implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. according to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses fuzzy inference systems to select cluster head. the alg...
متن کاملAn Efficient Algorithm for Inference in Rough Set Flow Graphs
Pawlak recently introduced rough set flow graphs (RSFGs) as a graphical framework for reasoning from data. No study, however, has yet investigated the complexity of the accompanying inference algorithm, nor the complexity of inference in RSFGs. In this paper, we show that the traditional RSFG inference algorithm has exponential time complexity. We then propose a new RSFG inference algorithm tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1986
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(86)80036-5